Computational hardness assumption - PDFSEARCH.IO - Document Search Engine

Computational hardness assumption
Results: 20

#	Item
11	Pairing-Based Identification Schemes Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:43 Public-key cryptography Finite fields BLS Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Zero-knowledge proof Digital signature Cryptography Computational hardness assumptions Cryptographic protocols
12	Boneh et al.’s k-Element Aggregate Extraction Assumption Is Equivalent to The Diffie-Hellman Assumption Jean-Sebastien Coron and David Naccache Gemplus Card International 34, rue Guynemer, Issy-les-Moulineaux, F-92447, Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Public-key cryptography Computational hardness assumptions BLS Diffie–Hellman problem Digital signature XTR Parity of a permutation Diffie–Hellman key exchange Structure Cryptography Finite fields Cryptographic protocols
13	Advances in Cryptology – Proceedings of Crypto ’07 (August 19–[removed], Santa Barbara, CA) A. Menezes Ed. Springer-Verlag, LNCS 4622, pages 482–499. A generalization of DDH with applications to protocol analysis a Add to Reading List Source URL: www.ssi.gouv.fr Language: English - Date: 2012-11-06 05:29:19 Decisional Diffie–Hellman assumption Mathematics Diffie–Hellman problem XTR Diffie–Hellman key exchange Computational Diffie–Hellman assumption Computational hardness assumptions Finite fields Cryptographic protocols
14	Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting Allison Lewko ∗ The University of Texas at Austin [removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-01-18 02:15:43 Linear algebra Cryptography Group theory Computational hardness assumptions Transpose XTR Decision Linear assumption Inner product space ID-based encryption Algebra Mathematics Abstract algebra
15	Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-10-16 13:57:22 Pseudorandomness Computational hardness assumptions Pseudorandom number generators Algorithmic information theory Pseudorandom generator Naor-Reingold Pseudorandom Function Decisional Diffie–Hellman assumption Pseudorandom function family Randomized algorithm Cryptography Theoretical computer science Applied mathematics
16	Victor Shoup Curriculum Vitae Feb. 6, 2014 Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer Street Add to Reading List Source URL: www.shoup.net Language: English - Date: 2014-02-06 21:21:47 Finite fields Cryptographic protocols Homomorphic encryption Diffie–Hellman problem Strong RSA assumption RSA Elliptic curve cryptography Actor model Eurocrypt Cryptography Public-key cryptography Computational hardness assumptions
17	A Practical and Provably Secure Coalition-Resistant Group Signature Scheme Giuseppe Ateniese1 , Jan Camenisch2 , Marc Joye3 , and Gene Tsudik4 Add to Reading List Source URL: www.zurich.ibm.com Language: English - Date: 2000-10-24 11:52:18 Finite fields Cryptographic protocols Group signature Diffie–Hellman key exchange Digital signature Computational Diffie–Hellman assumption ElGamal encryption Diffie–Hellman problem Schnorr signature Cryptography Computational hardness assumptions Public-key cryptography
18	Evaluation of Security Level of Cryptography: ACE Signature Scheme Alfred Menezes, Minghua Qu, Doug Stinson, Yongge Wang Add to Reading List Source URL: www.ipa.go.jp Language: English - Date: 2013-06-03 22:32:58 Electronic commerce Key management RSA Integer factorization Digital signature Key size Strong RSA assumption Elliptic curve cryptography Random oracle Cryptography Public-key cryptography Computational hardness assumptions
19	In Advances in Cryptology—CRYPTO ’99, Vol[removed]of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp[removed]A Simple Publicly Verifiable Secret Sharing Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2001-04-03 10:12:09 Public-key cryptography Publicly Verifiable Secret Sharing Finite fields Verifiable secret sharing Secret sharing ElGamal encryption Diffie–Hellman key exchange Diffie–Hellman problem Decisional Diffie–Hellman assumption Cryptography Cryptographic protocols Computational hardness assumptions
20	Workshop on Selected Areas in Cryptography[removed] – 16 august 2002, St. John’s, Newfoundland, Canada) H. Heys and K. Nyberg Eds. Springer-Verlag, LNCS 2595, pages 325–338 Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2007-07-06 16:33:16 Finite fields Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Hellman ElGamal encryption Whitfield Diffie XDH assumption Cryptography Computational hardness assumptions Cryptographic protocols

UPDATE